Cross-domain Heuristic Search Challenge: GISS Algorithm presentation
نویسندگان
چکیده
Generic Iterative Simulated-Annealing Search (GISS) is a hyper-heuristic algorithm inspired on a Simulated Annealing driven method, on this context its used to explore across the different instance-heuristicstate search space. On this extended abstract we describe the proposed approach, characteristics and others technicals parameters.
منابع مشابه
A Reinforcement Learning approach for the Cross-Domain Heuristic Search Challenge
The International Cross-Domain Heuristic Search Challenge (hereinafter CHeSC 2011) [3] is an ongoing competition that prompts for the design of a generally applicable high-level strategy for the automatic selection of problem-specific low-level heuristics across different problem domains. We participate in the challenge with a Reinforcement Learning approach. In this paper we describe the curre...
متن کاملThe Cross-Domain Heuristic Search Challenge - An International Research Competition
The first Cross-domain Heuristic Search Challenge (CHeSC 2011) seeks to bring together practitioners from operational research, computer science and artificial intelligence who are interested in developing more generally applicable search methodologies. The challenge is to design a search algorithm that works well, not only across different instances of the same problem, but also across differe...
متن کاملHyper-heuristics for cross-domain search
In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performa...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملKSATS-HH: A Simulated Annealing Hyper-Heuristic with Reinforcement Learning and Tabu-Search
The term hyper-heuristics describes a broad range of techniques that attempt to provide solutions to an array of problems from different domains. This paper describes the implementation of a hyperheuristic developed for entry into the Cross-domain Heuristic Search Challenge organised by the Automated Scheduling, Optimisation and Planning research group at the University of Nottingham. An algori...
متن کامل